Resolution Theorem Proving, Logic Programming, Automatic Reasoning, Satisfiability
LOGICPO: Efficient Translation of NL-based Logical Problems to FOL using LLMs and Preference Optimization
arxiv.org·1d
LFCS Seminar Friday 27th June: John Longley
informatics.ed.ac.uk·2d
Counting with Categories (Part 1)
golem.ph.utexas.edu·2d
ML in the Home
blog.raymond.burkholder.net·1d
Cactus Language • Syntax 11
inquiryintoinquiry.com·1d
Proving that every program halts
ntietz.com·2d
Diving deep into Binius M3 arithmetization using Merkle tree inclusion as an example
blog.lambdaclass.com·1d
Brent Yorgey: Competitive programming in Haskell: range queries, classified
byorgey.github.io·2d
Programming by Backprop: LLMs Acquire Reusable Algorithmic Abstractions During Code Training
arxiv.org·1d
Agentic AI: Implementing Long-Term Memory
towardsdatascience.com·18h
Loading...Loading more...